Bipancyclic properties of Cayley graphs generated by transpositions
نویسندگان
چکیده
Cycle is one of the most fundamental graph classes. For a given graph, it is interesting to find cycles of various lengths as subgraphs in the graph. The Cayley graph Cay(Sn, S) on the symmetric group has an important role for the study of Cayley graphs as interconnection networks. In this paper, we show that the Cayley graph generated by a transposition set is vertex-bipancyclic if and only if it is not the star graph. We also provide a necessary and sufficient condition for Cay(Sn, S) to be edge-bipancyclic.
منابع مشابه
On the automorphism group of Cayley graphs generated by transpositions
The modified bubble-sort graph of dimension n is the Cayley graph of Sn generated by n cyclically adjacent transpositions. In the present paper, it is shown that the automorphism group of the modified bubble sort graph of dimension n is Sn × D2n, for all n ≥ 5. Thus, a complete structural description of the automorphism group of the modified bubble-sort graph is obtained. A similar direct produ...
متن کاملRotational Cayley Graphs on Transposition Generated Groups
As it is introduced by Bermond, Kodate, and Prennes, some Cayley graphs, including most popular models for interconnection networks, admit a special auto-morphism, called complete rotation. Such an automorphism is often used to derive algorithms or properties of the underlying graph. For example, optimal gossiping algorithms can be easily designed, and the constructions of the best known edge d...
متن کاملOn the eigenvalues of Cayley graphs on the symmetric group generated by a complete multipartite set of transpositions
Given a finite simple graph G with n vertices, we can construct the Cayley graph on the symmetric group Sn generated by the edges of G , interpreted as transpositions. We show that, if G is complete multipartite, the eigenvalues of the Laplacian of Cay(G ) have a simple expression in terms of the irreducible characters of transpositions and of the Littlewood–Richardson coefficients. As a conseq...
متن کاملCayley graphs and symmetric interconnection networks
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley graphs. We then discuss automorphism groups of Cayley graphs. We prove that the vertex-connectivity of edge-transitive graphs is maximum possible. We investigate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 310 شماره
صفحات -
تاریخ انتشار 2010